The Pathological Liar
نویسندگان
چکیده
منابع مشابه
Ulam's pathological liar game with one half-lie
We introduce a dual game to Ulam’s liar game and consider the case of one half-lie. In the original Ulam’s game, Paul attempts to isolate a distinguished element by disqualifying all but one of n possibilities with q Yes-No questions, while the responder Carole is allowed to lie a fixed number k of times. In the dual game, Paul attempts to prevent disqualification of a distinguished element by ...
متن کاملThe Liar in Context
About twenty-five years ago, Charles Parsons published a paper that began by asking why we still discuss the Liar Paradox. Today, the question seems all the more apt. In the ensuing years we have seen not only Parsons’ work (1974), but seminal work of Saul Kripke (1975), and a huge number of other important papers. Too many to list. Surely, one of them must have solved it! In a way, most of the...
متن کاملThe simple liar without bivalence?
1. Background The Simple Liar is a sentence that says of itself only that it is false. The Strengthened Liar is a sentence that says of itself only that it is not true. How does the Strengthened Liar differ from its (allegedly) weaker brother, namely, the Simple Liar? According to standard thinking the Simple Liar, unlike the Strengthened Liar, yields inconsistency only if the following princip...
متن کاملThe Pathological Liar: An Exclusionary Approach to Self- Referential Contradictions in Natural Language
The liar’s paradox is a simple yet harrowing problem that has plagued logicians and philosophers who study natural language. It is an uncommon sentence, and perhaps a largely useless one outside of artificially-created circumstances. However, it threatens to undo any naivelyconstructed theory of natural language semantics, if the theory does not take the paradox into account. Indeed, many well-...
متن کاملThe Rényi-Ulam pathological liar game with a fixed number of lies
The q-round Rényi-Ulam pathological liar game with k lies on the set [n] := {1, . . . , n} is a 2-player perfect information zero sum game. In each round Paul chooses a subset A ⊆ [n] and Carole either assigns 1 lie to each element of A or to each element of [n]\A. Paul wins if after q rounds there is at least one element with k or fewer lies. The game is dual to the original Rényi-Ulam liar ga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Nervous and Mental Disease
سال: 1919
ISSN: 0022-3018
DOI: 10.1097/00005053-191904000-00061